
/*public class Solution {
    public int removeElement(int[] nums, int val) {
        int left = 0;
        int right = nums.length - 1;
        while(left <= right){
            if(nums[left] != val){
                left++;
            }else if(nums[right] == val){
                right--;
            }else{
                nums[left] = nums[right];
                right--;
            }
        }
        return left;
    }
}*/

/*class Solution {
    public int removeElement(int[] nums, int val) {
        int left = 0;
        int right = nums.length - 1;
        while(left <= right){
            if(nums[left] != val){
                left++;
            }else if(nums[right] == val){
                right--;
            }else{
                nums[left] = nums[right];
                right--;
            }
        }
        return left;
    }
}*/

/*class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        for (int i = 0; i != n; ++i) {
            nums1[m + i] = nums2[i];
        }
        Arrays.sort(nums1);
    }
}*/
